On periods modulo p in arithmetic dynamics
نویسندگان
چکیده
منابع مشابه
On periods modulo p in arithmetic dynamics ∗ †
We prove the following mod p version of a case of the dynamical André-Oort conjecture obtained in [GKN ]. Theorem. There are constants c1, c2 depending on d and h such that the following holds. For almost all P, there is a finite subset T ⊂ F̄P , |T | ≤ c1 such that if t ∈ F̄P \ T at least one of the sets { f (`) t (0) : ` = 1, 2, · · · , [c2 logN ] } , { g (`) t (0) : ` = 1, 2, · · · , [c2 logN ...
متن کاملVariation of periods modulo p in arithmetic dynamics
Let φ : V → V be a self-morphism of a quasiprojective variety defined over a number field K and let P ∈ V (K) be a point with infinite orbit under iteration of φ. For each prime p of good reduction, let mp(φ, P ) be the size of the φ-orbit of the reduction of P modulo p. Fix any ǫ > 0. We show that for almost all primes p in the sense of analytic density, the orbit size mp(φ, P ) is larger than...
متن کاملPeriods of Orbits modulo Primes
Let S be a monoid of endomorphisms of a quasiprojective variety V defined over a global field K. We prove a lower bound for the size of the reduction modulo places of K of the orbit of any point α ∈ V (K) under the action of the endomorphisms from S. We also prove a similar result in the context of Drinfeld modules. Our results may be considered as dynamical variants of Artin’s primitive root c...
متن کاملArithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the structure of cut free proofs is the key to many results about predicate logic with no axioms: analyticity and non-provability results, completeness results for proof search algorithms, decidability results for fragments...
متن کاملSuperposition Modulo Non-linear Arithmetic
The first-order theory over non-linear arithmetic including transcendental functions (NLA) is undecidable. Nevertheless, in this paper we show that a particular combination with superposition leads to a sound and complete calculus that is useful in practice. We follow basically the ideas of the SUP(LA) combination, but have to take care of undecidability, resulting in “unknown” answers by the N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2015
ISSN: 1631-073X
DOI: 10.1016/j.crma.2015.01.007